Connecting ABT with a SAT Solver
نویسندگان
چکیده
Many real-world problems are nowadays encoded into SAT instances and efficiently solved by CDCL SAT solvers. However, some scenarios require distributed problem solving approaches. Privacy is often the main reason. This causes the distributed SAT problem. In this work, we analyze how this problem can be tacked in an efficient way, and present ABTSAT, a new version of the ABT algorithm adapted to solve distributed SAT instances. It combines ABT execution with calls to CDCL SAT solvers and clause learning. ABTSAT is sound and complete, properties inherited from ABT, and solves local problems efficiently by using CDCL SAT solvers.
منابع مشابه
ABT with Clause Learning for Distributed SAT
Transforming a planning instance into a propositional formula φ to be solved by a SAT solver is a common approach in AI planning. In the context of multiagent planning, this approach causes the distributed SAT problem: given φ distributed among agents –each agent knows a part of φ but no agent knows the whole φ–, check if φ is SAT or UNSAT by message passing. On the other hand, Asynchronous Bac...
متن کاملParallel SAT Solver Selection and Scheduling
Combining differing solution approaches by means of solver portfolios has proven as a highly effective technique for boosting solver performance. We consider the problem of generating parallel SAT solver portfolios. Our approach is based on a recently introduced sequential SAT solver portfolio that excelled at the last SAT competition. We show how the approach can be generalized for the paralle...
متن کاملA Fast SAT Solver for Isabelle in Standard ML
This contribution contains a fast SAT solver for Isabelle written in Standard ML. By loading the theory DPT SAT Solver, the SAT solver installs itself (under the name “dptsat”) and certain Isabelle tools like Refute will start using it automatically. This is a port of the DPT (Decision Procedure Toolkit) SAT Solver written in OCaml. Theory DPT SAT Tests tests the solver on a few hundred problems.
متن کاملHordeSat: A Massively Parallel Portfolio SAT Solver
A simple yet successful approach to parallel satisfiability (SAT) solving is to run several different (a portfolio of) SAT solvers on the input problem at the same time until one solver finds a solution. The SAT solvers in the portfolio can be instances of a single solver with different configuration settings. Additionally the solvers can exchange information usually in the form of clauses. In ...
متن کاملFrom Total Assignment Enumeration to Modern SAT Solver
A new framework for presenting and analyzing the functionality of a modern DLL-based SAT solver is proposed. Our approach exploits the inherent relation between backtracking and resolution. We show how to derive the algorithm of a modern SAT solver from DLL stepby-step. We analyze the inference power of Boolean Constraint Propagation, Non-Chronological Backtracking and 1UIP-based Conflict-Direc...
متن کامل